1217C - The Number Of Good Substrings - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;


#define ll long long
#define vt vector
#define ar array

ll convert(ll n){

	ll dec = 0, i = 0, rem;

	while (n!=0) {
		rem = n % 10;
		n /= 10;
		dec += rem * pow(2, i);
		++i;
	}

	return dec;

}


void solve(){
		
	string num;

	cin >> num;

	ll mynum = 0;

	ll length = 0;
	ll res = 0;

	for(int i = 0; i < num.size(); i++){
		if (num[i] == '0') length++;
		else{
			mynum = 0;
			for(int j = 0; j < 19 && i + j < num.size(); j++){
				mynum *= 10;
				mynum += num[i + j] - '0';
				length++;
				ll mydec = convert(mynum);
				if (length >= mydec) res++;
			}
			length = 0;
		}
	}
	cout << res << endl;

}

int main(){

	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int testcases = 1;

	cin >> testcases;

	while(testcases--){
		solve();
	}

	return 0;

}